 | Curriculum Vitae Robert Endre Tarjan December 17, 2012 Home Co-Director, National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science (dimacs) 203.28 Kb.  2 | read |
 | Curriculum Vitae Robert Endre Tarjan January 2, 2004 Home Co-Director, National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science (dimacs) 106.37 Kb. 2 | read |
| Curriculum Vitae Robert Endre Tarjan December 19, 2011 Home Co-Director, National Science Foundation Center for Discrete Mathematics and Theoretical Computer Science (dimacs) 134.74 Kb. 2 | read |
| University questions The function f(n) = O(g(n)) iff there exist positive constants c and no such that f(n)£ c g(n) for all n, n ³n0 135.38 Kb. 1 | read |
| Objective: Learn to analyze the time complexity of an algorithm To evaluate an algorithm efficiency, often we are interested in the rate of growth of the time or space required to solve larger instances of a kind of problem 45.54 Kb. 1 | read |
| University questions The function f(n) = O(g(n)) iff there exist positive constants c and no such that f(n)£ c g(n) for all n, n ³n0 0.58 Mb. 4 | read |
| The mid-term exam will take place on Friday, Feb. 6, Ee1-105. 4: 00-5: 00 pm You can bring any written material to the exam (this includes books, lecture notes, your hw, anything else you find useful). No energy-consuming gadgets are allowed 37.27 Kb. 1 | read |
1